An Evaluation of First-Come, First-Served Scheduling in a Geometrically-Constrained Wet Bulk Terminal

نویسندگان

چکیده

In 2022, a new sea lock at IJmuiden is expected to open, permitting an increase in marine traffic of larger ships from the port. interest facilitating operations, we evaluate impact current first-come, first-served (FCFS) admittance policy context berth allocation for wet bulk terminal Four model types are constructed: optimal FCFS; no FCFS with fixed arrival times; 48-h time relaxation; and complete relaxation. Comparison done by means rolling window: each day within frame, schedule was created following 2 weeks, after which objective value calculated. When comparing average all values, it found that already shows improvement compared historical situation. Between model, there considerable differences, because vessels constrained be scheduled on/after their relaxation allowed, efficiency gain possible, especially if arrive

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

First Come , First Served ' can be unstable !

We consider exible manufacturing systems using thèFirst Come, First Served' (FCFS or FIFO) scheduling policy at each machine. We describe and discuss in some detail simple deterministic examples which have adequate capacity but which, under FCFS, can exhibit instability: unboundedly growing WIP taking the form of a repeated pattern of behavior with the repetitions on an increasing scale.

متن کامل

First-come-first-served packet dispersion and implications for TCP

We study the packet dispersion phenomenon that a traffic flow experiences when it passes through a router. We show that when there are competing flows and the router schedules packets first-come-first-served (FCFS), the dispersion is not described well by the bottleneck spacing effect. We therefore introduce the term FCFS-spacing effect. We also show that for a router implementing weighted fair...

متن کامل

Simulation of First Come First Served (FCFS) and Shortest Job First (SJF) Algorithms

Development of scheduling algorithms is directly related with the development of operating system which brings difficulties in implementation. Any modification on the scheduling algorithm will appear as modification on the operating system kernel code. Processor is an important source of cpu scheduling process, so it becomes very important on accomplishing of the operating system design goals. ...

متن کامل

Improving First-Come-First-Serve Job Scheduling by Gang Scheduling

We present a new scheduling method for batch jobs on massively parallel processor architectures. This method is based on the First– come–first–serve strategy and emphasizes the notion of fairness. Severe fragmentation is prevented by using gang scheduling which is only initiated by highly parallel jobs. Good worst–case behavior of the scheduling approach has already been proven by theoretical a...

متن کامل

Alternative life-history and transmission strategies in a parasite: first come, first served?

Alternative transmission strategies are common in many parasitic organisms, often representing discrete phenotypes adopted in response to external cues. The facultative truncation of the normal 3-host life-cycle to a 2-host cycle in many trematodes provides an example: some individuals mature precociously, via progenesis, in their intermediate host and produce eggs without the need to reach a d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Frontiers in future transportation

سال: 2021

ISSN: ['2673-5210']

DOI: https://doi.org/10.3389/ffutr.2021.709822